The Correlation Between Parity and Quadratic Polynomials Mod 3
نویسنده
چکیده
We prove exponentially small upper bounds on the correlation between parity and quadratic polynomials mod 3: One corollary of this is that in order to compute parity, circuits consisting of a threshold gate at the top, mod 3 gates in the middle, and AND gates of fan-in two at the inputs must be of size 2OðnÞ: This is the first result of this type for general mod 3 subcircuits with ANDs of fan-in greater than 1. This yields an exponential improvement over a long-standing result of Smolensky, answering a question recently posed by Alon and Beigel. The proof uses a novel inductive estimate of the relevant exponential sums introduced by Cai, Green and Thierauf. The exponential sum and correlation bounds presented here are tight. r 2004 Elsevier Inc. All rights reserved.
منابع مشابه
The Correlation Between Parity and Quadratic Polynomials
We prove exponentially small upper bounds on the correlation between parity and quadratic polynomials mod 3. One corollary of this is that in order to compute parity, circuits consisting of a threshold gate at the top, mod 3 gates in the middle, and AND gates of fan-in two at the inputs must be of size 2. This is the first result of this type for general mod 3 subcircuits with ANDs of fan-in gr...
متن کاملUniqueness of Optimal Mod 3 Polynomials for Parity
In this paper, we completely characterize the quadratic polynomials modulo 3 with the largest (hence “optimal”) correlation with parity. This result is obtained by analysis of the exponential sum
متن کاملUniqueness of Optimal Mod 3 Circuits for Parity
In this paper, we prove that the quadratic polynomials modulo 3 with the largest correlation with parity are unique up to permutation of variables and constant factors. As a consequence of our result, we completely characterize the smallest MAJ◦ MOD3 ◦ AND2 circuits that compute parity, where a MAJ ◦MOD3 ◦ AND2 circuit is one that has a majority gate as output, a middle layer of MOD3 gates and ...
متن کاملParity Results for p-Regular Partitions with Distinct Parts
We consider the partition function bp(n), which counts the number of partitions of the integer n into distinct parts with no part divisible by the prime p. We prove the following: Let p be a prime greater than 3 and let r be an integer between 1 and p−1, inclusively, such that 24r + 1 is a quadratic nonresidue modulo p. Then, for all nonnegative integers n, bp(pn + r) ≡ 0 (mod 2).
متن کاملCongruences involving Bernoulli polynomials
Let {Bn(x)} be the Bernoulli polynomials. In the paper we establish some congruences for Bj(x) (mod p n), where p is an odd prime and x is a rational p-integer. Such congruences are concerned with the properties of p-regular functions, the congruences for h(−sp) (mod p) (s = 3, 5, 8, 12) and the sum P k≡r (mod m) p k , where h(d) is the class number of the quadratic field Q(d) of discriminant d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002